Computing All Nonsingular Solutions of Cyclic-n Polynomial Using Polyhedral Homotopy Continuation Methods
نویسندگان
چکیده
All isolated solutions of the cyclic-n polynomial equations are not known for larger dimensions than 8 except the dimensions 10 and 11. We exploit two types of symmetric structures in the cyclic-n polynomial to compute all isolated nonsingular solutions of the equations efficiently by the polyhedral homotopy continuation method and to verify the correctness of the generated approximate solutions. Numerical results on the cyclic-8 to the cyclic-12 polynomial equations, including their solution information, are given.
منابع مشابه
Enumeration of All Solutions of a Combinatorial Linear Inequality System Arising from the Polyhedral Homotopy Continuation Method
An interesting combinatorial (enumeration) problem arises in the initial phase of the polyhedral homotopy continuation method for computing all solutions of a polynomial equation system in complex variables. It is formulated as a problem of finding all solutions of a specially structured system of linear inequalities with a certain additional combinatorial condition. This paper presents a compu...
متن کاملPHoM: Polyhedral Homotopy Continuation Method for Polynomial Systems
PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the first module StartSystem constructs a family of polyhedrallinear homotopy functions, based on the polyhedral homotopy theory, from input data for a given system of polynomial equations f(x) = 0. The second m...
متن کاملA Special Homotopy Continuation Method for a Class of Polynomial Systems
A special homotopy continuation method, as a combination of the polyhedral homotopy and the linear product homotopy, is proposed for computing all the isolated solutions to a special class of polynomial systems. The root number bound of this method is between the total degree bound and the mixed volume bound and can be easily computed. The new algorithm has been implemented as a program called ...
متن کاملEnumeration of All Solutions of a Combinatorial Linear Inequality System Arising from Tee Polyhedral Homotopy Continuation Met
An interesting combinatorial (enumeration) problem arises in the initial phase of the polyhedral homotopy continuation method for computing a11 so1utions of a polynomial equation system in complex variables. It is formulated as a problem of finding all solutions of a specially structured system of linear inequalities with a certain additional combinatorial condition. This paper presents a compu...
متن کاملCmpsm : a Continuation Method for Polynomial Systems (matlab Version)
CMPSm is a MATLAB program using a predictor-corrector path-following method for tracing homotopy curves to approximate all isolated solutions of a system of polynomial equations. The program was originally developed for the cheater's homotopy, but it can be also used for linear and polyhedral homotopies. The software CMPSm, this manual and some numerical examples are available at
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001